A New Iterative Method for Solving Nonlinear Equations
نویسنده
چکیده
In this study, a new root-finding method for solving nonlinear equations is proposed. This method requires two starting values that do not necessarily bracketing a root. However, when the starting values are selected to be close to a root, the proposed method converges to the root quicker than the secant method. Another advantage over all iterative methods is that; the proposed method usually converges to two distinct roots when the given function has more than one root, that is, the odd iterations of this new technique converge to a root and the even iterations converge to another root. Some numerical examples, including a sine-polynomial equation, are solved by using the proposed method and compared with results obtained by the secant method; perfect agreements are found.polynomial equations, nonlinear equations. NE classical problem in numerical analysis is the solution of nonlinear equations 0) (= x f. To approximate a solution to one of these equations we can use iterative methods. An iterative method starts from two initial guesses 0 x and 1 x , which are then improved by means of a sequence { }) , (1 1 1 k k k k x x x − ∞ = + Φ = , 1 ≥ k , is known as a two-point iterative method. Conditions are imposed on 0 x , 1 x and, eventually, on f or Φ or both, in order to ensure the convergence of the sequence to { } 1 + k x for 1 ≥ k to a solution α of the nonlinear equation 0) (= x f , then proceed to find the order of convergence of the sequence. In this paper, we shall study a new iterative approach that requires two starting values, but the order of convergence and the convergence criterion of the proposed method will be put off to a later extended work. Assume that) (), (x f x f ′ and) (x f ′ ′ are continuous near a root α , then the graphs of the functions) (x f and) (x f − intersect the x-axis at the point) 0 , (α. Furthermore, assume that initial approximations 0 x and 1 x are near the root α and 1 0 x x ≠ , then the points)) (, (0 0 x f x and)) (, (1 1 x f x lie on the curve of) (x f y = near the …
منابع مشابه
A SIXTH ORDER METHOD FOR SOLVING NONLINEAR EQUATIONS
In this paper, we present a new iterative method with order of convergence eighth for solving nonlinear equations. Periteration this method requires three evaluations of the function and one evaluation of its first derivative. A general error analysis providing the eighth order of convergence is given. Several numerical examples are given to illustrate the efficiency and performance of the new ...
متن کاملNew iterative methods with seventh-order convergence for solving nonlinear equations
In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.
متن کاملA new iteration method for solving a class of Hammerstein type integral equations system
In this work, a new iterative method is proposed for obtaining the approximate solution of a class of Hammerstein type Integral Equations System. The main structure of this method is based on the Richardson iterative method for solving an algebraic linear system of equations. Some conditions for existence and unique solution of this type equations are imposed. Convergence analysis and error bou...
متن کاملTwo new three and four parametric with memory methods for solving nonlinear equations
In this study, based on the optimal free derivative without memory methods proposed by Cordero et al. [A. Cordero, J.L. Hueso, E. Martinez, J.R. Torregrosa, Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation, Mathematical and Computer Modeling. 57 (2013) 1950-1956], we develop two new iterative with memory methods for solving a nonline...
متن کاملSolving System of Nonlinear Equations by using a New Three-Step Method
In this paper, we suggest a fifth order convergence three-step method for solving system of nonlinear equations. Each iteration of the method requires two function evaluations, two first Fr'{e}chet derivative evaluations and two matrix inversions. Hence, the efficiency index is $5^{1/({2n+4n^{2}+frac{4}{3}n^{3}})}$, which is better than that of other three-step methods. The advant...
متن کاملA new iterative with memory class for solving nonlinear equations
In this work we develop a new optimal without memory class for approximating a simple root of a nonlinear equation. This class includes three parameters. Therefore, we try to derive some with memory methods so that the convergence order increases as high as possible. Some numerical examples are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 178 شماره
صفحات -
تاریخ انتشار 2005